Digital Almost Nets
نویسندگان
چکیده
Digital nets (in base 2) are the subsets of [0,1]d that contain exactly expected number points in every not-too-small dyadic box. We construct finite sets, which we call "almost nets", such box contains almost from set, but whose size is exponentially smaller than one nets. also establish a lower bound on
منابع مشابه
The Discrepancy of Digital Nets
Digital sequences and nets are among the most popular kinds of low discrepancy sequences and are often used for quasi-Monte Carlo quadrature rules. Several years ago Owen proposed a method of scrambling digital sequences and recently Faure and Tezuka have proposed another method. This article considers the discrepancy of digital nets under these scramblings. The first main result of this articl...
متن کاملdigital communication nets and n-port resistive networks
a communication net is usually represented by a linear graph g whose branches represent channels for information flow and whose vertices represent sources, sinks and switching centers. the purpose of this paper is to show that for modeling digital communication nets, conventional use of the concepts of capacity and terminal capacity is inadequate . we will present an alternative to max-flow min...
متن کاملFast almost-linear-sized nets for boxes in the plane
Let B be any set of n axis-aligned boxes in R, d ≥ 1. For any point p, we define the subset Bp of B as Bp = {B ∈ B : p ∈ B}. A box B in Bp is said to be stabbed by p. A subset N ⊆ B is a (1/c)-net for B if Np 6= ∅ for any p ∈ R such that |Bp| ≤ n/c. The number of distinct subsets Bp is O((2n)), so the set system described above has so-called finite VCdimension d. This ensures that there always ...
متن کاملConstruction of digital nets from BCH-codes
We establish a link between the theory of error-correcting codes and the theory of (t, m, s)-nets. This leads to the fundamental problem of net embeddings of linear codes. Our main result is the construction of four infinite families of digital (t, m, s)-nets based on BCH-codes.
متن کاملBounds for digital nets and sequences
1. Introduction. Currently, the most effective constructions of low-discrepancy point sets and sequences, which are of great importance for quasi-Monte Carlo methods in multidimensional numerical integration, are based on the concept of (t, m, s)-nets and (t, s)-sequences. A detailed theory was developed in Niederreiter [9] (see also [10, Chapter 4] for surveys of this theory). So-called digita...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2022
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10791